An adaptive large neighborhood search heuristic to optimize mineral value chains under metal and material type uncertainty
نویسندگان
چکیده
This paper addresses the optimisation of mineral value chains under metal and material type uncertainty. A mathematical model to simultaneously optimise extraction decisions destination is proposed. fix-and-optimise scheme that exploits structure problem uses relaxation decomposition techniques introduced obtain an initial solution, adaptive large neighbourhood search heuristic developed improve this solution. The proposed solution approach tested on a real copper-gold mining complex. results these experiments show ability efficiently address instances realistic size provide schedules where most valuable mined processed early in life mine risk not meeting production targets successfully managed.
منابع مشابه
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route and such that a pickup...
متن کاملReinforced Adaptive Large Neighborhood Search
The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particularity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the current solution. Large Neighborhood Search h...
متن کاملAn Adaptive Large Neighborhood Search Heuristic for a Multi-Period Vehicle Routing Problem
We consider tactical planning for a particular class of multi-period vehicle routing problems (MPVRP). This problem involves optimizing product collection and distribution from several production locations to a set of processing plants over a planning horizon. Each horizon consists of several days, and the collection-distribution are performed on a repeating daily basis. In this context, a sing...
متن کاملAn adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...
متن کاملAn adaptive large neighborhood search heuristic for the share-a-ride problem
The Share-a-Ride Problem (SARP) aims at maximizing the profit of serving a set of passengers and parcels using a set of homogeneous vehicles. We propose an adaptive large neighborhood search (ALNS) heuristic to address the SARP. Furthermore, we study the problem of determining the time slack in a SARP schedule. Our proposed solution approach is tested on three sets of realistic instances. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mining, Reclamation and Environment
سال: 2021
ISSN: ['1748-0949', '1748-0930']
DOI: https://doi.org/10.1080/17480930.2021.1949858